Methods for determining the ancestor nodes priority number of the expanded node and selecting effectively the ancestor nodes by means of the priority number are also given. 给出了一个包含有向回路的与或图的求解算法,以及如何确定被扩展节点的祖先节点的优先数,并通过优先数有效地选取祖先节点的方法也在本文中给出。
The algorithm can directly determine the ancestors-descendants or parents-children relationship between potential ancestor node set and descendant node set, and do not access the real storage nodes. 算法能够根据XML/GML非空间数据索引信息直接判断潜在先辈、子孙节点集中节点间的先辈子孙(或父子)关系,而无需访问实际存储的节点。